On edge but not vertex transitive regular graphs
نویسندگان
چکیده
منابع مشابه
Constructing Cubic Edge-but Not Vertex-transitive Graphs
Slovenija Abstract An innnite family of cubic edge-transitive but not vertex-transitive graph graphs with edge stabilizer isomorphic to Z Z 2 is constructed.
متن کاملConstructing cubic edge- but not vertex-transitive graphs
An in nite family of cubic edge transitive but not vertex transitive graph graphs with edge stabilizer isomorphic to Z is constructed
متن کاملAn infinite series of regular edge- but not vertex-transitive graphs
Let n be an integer and q be a prime power. Then for any 3 ≤ n ≤ q − 1, or n = 2 and q odd, we construct a connected q-regular edgebut not vertextransitive graph of order 2qn+1. This graph is defined via a system of equations over the finite field of q elements. For n = 2 and q = 3, our graph is isomorphic to the Gray graph.
متن کاملStrongly regular edge-transitive graphs
In this paper, we examine the structure of vertexand edge-transitive strongly regular graphs, using normal quotient reduction. We show that the irreducible graphs in this family have quasiprimitive automorphism groups, and prove (using the Classification of Finite Simple Groups) that no graph in this family has a holomorphic simple automorphism group. We also find some constraints on the parame...
متن کاملSmall vertex-transitive directed strongly regular graphs
We consider directed strongly regular graphs de2ned in 1988 by Duval. All such graphs with n vertices, n6 20, having a vertex-transitive automorphism group, are determined with the aid of a computer. As a consequence, we prove the existence of directed strongly regular graphs for three feasible parameter sets listed by Duval. For one parameter set a computer-free proof of the nonexistence is pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1972
ISSN: 0095-8956
DOI: 10.1016/0095-8956(72)90030-5